VI_SDB: a convivial approach for description and manipulation of deductive and stratified databases
نویسنده
چکیده
Although deductive databases is based on a well established formalism, they didn't know the expected success. Their use was limited to the academic purpose. Indeed, the deductive database management systems are judged abstract, rare in commercial offers, and often expensive. In among the abstract concepts of the deductive databases, we mention the case of the negation and its treatment by the stratification. In this paper, we propose a convivial approach that aims to make transparent theses concepts relatively abstracted and to permit a friendly usse of deductive databases and stratified database. This approach permits to simplify concepts, which always remain delicate for this type of databases users or designers, like (1) the definition of a deductive and/or stratified database (2) the study of the stratifiability, (3) the determination of the maximal stratification, (4) the incremental definition of strata and (5) the checking of integrity constraints. These operations become more delicate if the database is voluminous. The proposed system supports rules update and is not limited to facts updating as in known deductive systems. This approach is implemented and validated with VI_SDB tool based on an extension of predicates nets.
منابع مشابه
Deductive Databases with Universally Quantified Conditions
This paper presents an extension to deductive databases, called quantified deductive databases, that incorporates universally quantified expressions (in coded form) in the body of rules. Since universally quantified expressions contain negations in their semantics, quantified deductive databases fall under the category of deductive databases with negation. Furthermore, depending on other factor...
متن کاملTemporal stratification tests for linear and branching-time deductive databases
We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal case. Moreover, as we demonstrate, the (more general) local stratification approach is impractical: detecting whether a temporal deductive database is locally stratified is...
متن کاملA compiler for stratified Datalog programs: preliminary results
Deductive databases originated from the confluence between logic programming and databases. The core language of deductive databases is Datalog, which has recently found a renewed interest and new applications in several real-world problems. The evaluation of Datalog is traditionally implemented in monolithic systems that are generalpurpose in the sense that they are able to process an entire c...
متن کاملOptimizing Query Answering in Description Logics using Disjunctive Deductive Databases
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator μ that transforms non-recursive ALC ontologies into a disjunctive deductive database. Contrary to our previous work, in this paper we focus on handling negation, disjunction and existential quantifiers, which cannot be handled by deducti...
متن کاملModeling Uncertainty in Deductive Databases
Information Source Tracking (IST) method has been developed recently for the modeling and manipulation of uncertain and inaccurate data in relational databases. In this paper we extend the IST method to deductive databases. We show that positive uncertain databases, i.e. IST-based deductive databases with only positive literals in the heads and the bodies of the rules, enjoy a least model/least...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. Arab J. Inf. Technol.
دوره 6 شماره
صفحات -
تاریخ انتشار 2009